The Generalizations of Newton’s Interpolation Formula Due to Mühlbach and Andoyer∗
نویسندگان
چکیده
Newton’s formula for constructing the interpolation polynomial is well–known. It makes use of divided differences. It was generalized around 1971–1973 by Mühlbach for interpolation by a linear family of functions forming a complete Chebyshev system. This generalization rests on a generalization of divided differences due to Popoviciu. In this paper, it is shown that Mühlbach’s formula is related to the work of Andoyer which goes back to the beginning of the century.
منابع مشابه
THE USE OF THE HE'S ITERATION METHOD FOR SOLVING NONLINEAR EQUATIONS USING CADNA LIBRARY
In this paper, we apply the Newton’s and He’s iteration formulas in order to solve the nonlinear algebraic equations. In this case, we use the stochastic arithmetic and the CESTAC method to validate the results. We show that the He’s iteration formula is more reliable than the Newton’s iteration formula by using the CADNA library.
متن کاملStructures for Interpolation, Decimation, and Nonuniform Sampling Based on Newton’s Interpolation Formula
The variable fractional-delay (FD) filter structure by Tassart and Depalle performs Lagrange interpolation in an efficient way. We point out that this structure directly corresponds to Newton’s interpolation (backward difference) formula, hence we prefer to refer to it as the Newton FD filter. This structure does not function correctly when the fractional delay is made time-variant, e.g., in sa...
متن کاملSharing several secrets based on Lagrange's interpolation formula and Cipher feedback mode
In a multi-secret sharing scheme, several secret values are distributed among a set of n participants.In 2000 Chien et al.'s proposed a (t; n) multi-secret sharing scheme. Many storages and publicvalues required in Chien's scheme. Motivated by these concerns, some new (t; n) multi-secret sharingschemes are proposed in this paper based on the Lagrange interpolation formula for polynomials andcip...
متن کاملOn the history of multivariate polynomial interpolation
Multivariate polynomial interpolation is a basic and fundamental subject in Approximation Theory and Numerical Analysis, which has received and continues receiving not deep but constant attention. In this short survey we review its development in the rst 75 years of this century, including a pioneering paper by Kronecker in the 19th century. x1. Introduction Interpolation, by polynomials or oth...
متن کاملThe new implicit finite difference scheme for two-sided space-time fractional partial differential equation
Fractional order partial differential equations are generalizations of classical partial differential equations. Increasingly, these models are used in applications such as fluid flow, finance and others. In this paper we examine some practical numerical methods to solve a class of initial- boundary value fractional partial differential equations with variable coefficients on a finite domain. S...
متن کامل